On Variable - Metric Methods for Sparse Hessians
نویسندگان
چکیده
The relationship between variable-metric methods derived by norm minimization and those derived by symmetrization of rank-one updates for sparse systems is studied, and an analogue of Dennis's nonsparse symmetrization formula derived. A new method of using norm minimization to produce a sparse analogue of any nonsparse variable-metric method is proposed. The sparse BFGS generated by this method is tested against the sparse PSB and variable-memory conjugate gradient methods, with computational experience uniformly favoring the sparse BFGS.
منابع مشابه
Logarithmic barriers for sparse matrix cones
Algorithms are presented for evaluating gradients and Hessians of logarithmic barrier functions for two types of convex cones: the cone of positive semidefinite matrices with a given sparsity pattern, and its dual cone, the cone of sparse matrices with the same pattern that have a positive semidefinite completion. Efficient large-scale algorithms for evaluating these barriers and their derivati...
متن کاملApproximating Hessians in unconstrained optimization arising from discretized problems
We consider Hessian approximation schemes for large-scale unconstrained optimization in the context of discretized problems. The considered Hessians typically present a nontrivial sparsity and partial separability structure. This allows iterative quasi-Newton methods to solve them despite of their size. Structured finitedifference methods and updating schemes based on the secant equation are pr...
متن کاملFusion of Thermal Infrared and Visible Images Based on Multi-scale Transform and Sparse Representation
Due to the differences between the visible and thermal infrared images, combination of these two types of images is essential for better understanding the characteristics of targets and the environment. Thermal infrared images have most importance to distinguish targets from the background based on the radiation differences, which work well in all-weather and day/night conditions also in land s...
متن کاملEfficient Computation of Sparse Hessians Using Coloring and Automatic Differentiation
using Coloring and Automatic Differentiation Assefaw H. Gebremedhin, Alex Pothen, Arijit Tarafdar Department of Computer Science and Center for Computational Sciences, Old Dominion University, Norfolk, VA, USA, {[email protected], [email protected], [email protected]} Andrea Walther Institute of Scientific Computing, Technische Universität Dresden, D-01062 Dresden, Germany, Andrea.Walther@tu...
متن کاملBandwidth and Wavefront Reduction for Static Variable Ordering in Symbolic Model Checking
We demonstrate the applicability of bandwidth and wavefront reduction algorithms to static variable ordering. In symbolic model checking event locality plays a major role in time and memory usage. For example, in Petri nets event locality can be captured by dependency matrices, where nonzero entries indicate whether a transition modifies a place. The quality of event locality has been expressed...
متن کامل